Robust Distributed Fusion With Labeled Random Finite Sets
نویسندگان
چکیده
منابع مشابه
Labeled Random Finite Sets in Multi-target Track-Before-Detect
In this paper we address the problem of tracking multiple targets based on raw measurements by means of Particle filtering. Bayesian multitarget tracking, in the Random Finite Set framework, propagates the multitarget posterior density recursively in time. Sequential Monte Carlo (SMC) approximations of the optimal filter are computationally expensive and lead to high-variance estimates as the n...
متن کاملConsensus Labeled Random Finite Set Filtering for Distributed Multi-Object Tracking
This paper addresses distributed multi-object tracking over a network of heterogeneous and geographically dispersed nodes with sensing, communication and processing capabilities. The main contribution is an approach to distributed multi-object estimation based on labeled Random Finite Sets (RFSs) and dynamic Bayesian inference, which enables the development of two novel consensus tracking filte...
متن کاملThe Entropy of Random Finite Sets
We define the Boltzmann-Gibbs entropy of random finite set on a general space X as the integration of logarithm of density function over the space of finite sets of X , where the measure for this integration is the dominating measure over this space. We show that with a unit adjustment term, the same value for entropy can be obtained using the calculus of set integrals which applies integration...
متن کاملPrincipled Random Finite Set Approximations of Labeled Multi-Object Densities
As a fundamental piece of multi-object Bayesian inference, multi-object density has the ability to describe the uncertainty of the number and values of objects, as well as the statistical correlation between objects, thus perfectly matches the behavior of multi-object system. However, it also makes the set integral suffer from the curse of dimensionality and the inherently combinatorial nature ...
متن کاملCupping with Random Sets
We prove that a set is K-trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K-trivial if and only if it is not ML-cuppable. These results settle a question of Kučera, who introduced both cuppability notions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2018
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2760286